On Mixing in Pairwise Markov Random Fields with Application to Social Networks
نویسندگان
چکیده
We consider pairwise Markov random fields which have a number of important applications in statistical physics, image processing and machine learning such as Ising model and labeling problem to name a couple. Our own motivation comes from the need to produce synthetic models for social networks with attributes. First, we give conditions for rapid mixing of the associated Glauber dynamics and consider interesting particular cases. Then, for pairwise Markov random fields with submodular energy functions we construct monotone perfect simulation.
منابع مشابه
Expected Duration of Dynamic Markov PERT Networks
Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...
متن کاملParallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Networks. Every application of an MRF requires addressing its inference problem, which can be done using deterministic inference methods or using stochastic Markov Chain Monte Carlo methods. In this paper we introduce a new...
متن کاملPTAS for MAP Assignment on Pairwise Markov Random Fields in Planar Graphs
We present a PTAS for computing the maximum a posteriori assignment on Pairwise Markov Random Fields with non-negative weights in planar graphs. This algorithm is practical and not far behind state-of-the-art techniques in image processing. MAP on Pairwise Markov Random Fields with (possibly) negative weights cannot be approximated unless P = NP, even on planar graphs. We also show via reductio...
متن کاملRunning head: Species interactions in Markov networks
5 Inferring species interactions from observational data is one of the most controversial tasks in 6 community ecology. One difficulty is that a single pairwise interaction can ripple through an 7 ecological network and produce surprising indirect consequences. For example, two 8 competing species would ordinarily correlate negatively in space, but this effect can be 9 reversed in the presence ...
متن کاملTitle: Estimating species interactions from observational data with Markov networks
Abstract: Estimating species interactions from observational data is one of the most 3 controversial tasks in community ecology. One difficulty is that a single pairwise interaction 4 can ripple through an ecological network and produce surprising indirect consequences. For 5 example, the negative correlation between two competing species can be reversed in the 6 presence of a third species tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016